Multi-task Scheduling of Agvs System Based on Improved NSGA-II Algorithm
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm Based on NSGA-II for Cloud PDTs Scheduling
Partly dependent tasks (PDTs) scheduling with multi-objective optimization in cloud computing is an NP-hard problem. Taking the quality of service (QoS) requirements of users that use cloud computing into account, we set the cost and time requirements of handling the PDTs as the multiple objectives and present an improved algorithm based on the non-dominated sorting genetic algorithm-II (NSGA-I...
متن کاملResearch on the Collision-Free Path Planning of Multi-AGVs System Based on Improved A* Algorithm
Path planning problem is the core and hot research topic of multiple Automatic Guided Vehicles (multi-AGVs) system. Although there are many research results, they do not solve the path planning problem from the perspective of reducing traffic congestion. A collision-free path planning method based on improved A* Algorithm for multi-AGVs logistics sorting system is proposed in this paper. In the...
متن کاملImproved NSGA-II Based on a Novel Ranking Scheme
Non-dominated Sorting Genetic Algorithm (NSGA) has established itself as a benchmark algorithm for Multiobjective Optimization. The determination of pareto-optimal solutions is the key to its success. However the basic algorithm suffers from a high order of complexity, which renders it less useful for practical applications. Among the variants of NSGA, several attempts have been made to reduce ...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملTask Scheduling Model Based on Multi-Agent and Multi-Objective Dynamical Scheduling Algorithm
With the increasing number of nodes in distributed systems, the complexity of task scheduling also increases. Therefore, how to schedule tasks reasonably is becoming more and more significant. Most traditional algorithms only consider a single condition without thinking over dynamic characteristic of system and tasks and lack of comprehensive measures. Therefore they cannot meet the needs of di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1924/1/012007